Lecture 17 Lecturer : Ariel Procaccia Scribe : David Kurokawa 1 Setting and Model

نویسنده

  • David Kurokawa
چکیده

To begin, we first rigorously define the model. The cake itself is represented by the real interval [0, 1] and a piece of this cake is a finite union of disjoint intervals X ⊆ [0, 1]. Furthermore, each agent i has a valuation function Vi that represents his/her assessment of pieces of the cake. That is, Vi(X) = x states that the piece X has value x to i. We will assume such Vi have the following properties:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simultaneous Cake Cutting

We introduce the simultaneous model for cake cutting (the fair allocation of a divisible good), in which agents simultaneously send messages containing a sketch of their preferences over the cake. We show that this model enables the computation of divisions that satisfy proportionality — a popular fairness notion — using a protocol that circumvents a standard lower bound via parallel informatio...

متن کامل

Equilibria of Generalized Cut and Choose Protocols

Classic cake cutting protocols — which fairly allocate a divisible good among agents with heterogeneous preferences — are susceptible to manipulation. Do their strategic outcomes still guarantee fairness? We model the interaction among agents as a game and study its Nash equilibria. We show that each protocol in the novel class of generalized cut and choose protocols — which includes the most i...

متن کامل

Biased Games

We present a novel extension of normal form games that we call biased games. In these games, a player’s utility is influenced by the distance between his mixed strategy and a given base strategy. We argue that biased games capture important aspects of the interaction between software agents. Our main result is that biased games satisfying certain mild conditions always admit an equilibrium. We ...

متن کامل

Lecturer : David P . Williamson Scribe : Faisal Alkaabneh

Today we will look at a matrix analog of the standard scalar Chernoff bounds. This matrix analog will be used in the next lecture when we talk about graph sparsification. While we’re more interested in the application of the theorem than its proof, it’s still useful to see the similarities and the differences of moving from the proof of the result for scalars to the same result for matrices. Sc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013